Effective usage of shortest paths promotes transportation efficiency on scale-free networks

With rapid economic and social development, the problem of traffic congestion is getting more and more serious. Accordingly, network traffic models have attracted extensive attention. In this paper, we introduce a shortest-remaining-path-first queuing strategy into a network traffic model on Barabási–Albert scale-free networks under efficient routing protocol, where one packet’s delivery priority is related to its current distance to the destination. Comparedwith the traditional first-in-first-out queuing strategy, although the network capacity has no evident changes, some other indexes reflecting transportation efficiency are significantly improved in the congestion state. Extensive simulation results and discussions are carried out to explain the phenomena. Our workmay be helpful for the designing of optimal networked-traffic systems. © 2013 Elsevier B.V. All rights reserved.